A Random Walk in Search of the Glass Transition
نویسندگان
چکیده
منابع مشابه
A phase transition in the random transposition random walk
Our work is motivated by Bourque and Pevzner’s (2002) simulation study of the effectiveness of the parsimony method in studying genome rearrangement, and leads to a surprising result about the random transposition walk on the group of permutations on n elements. Consider this walk in continuous time starting at the identity and let Dt be the minimum number of transpositions needed to go back to...
متن کاملA Random Walk with Exponential Travel Times
Consider the random walk among N places with N(N - 1)/2 transports. We attach an exponential random variable Xij to each transport between places Pi and Pj and take these random variables mutually independent. If transports are possible or impossible independently with probability p and 1-p, respectively, then we give a lower bound for the distribution function of the smallest path at point log...
متن کاملTabu Search vs. Random Walk
We investigate the beneet of Tabu Search for satissability (SAT) and constraint satisfaction problems (CSP) and compare it to the more frequently used random walk heuristic. We argue, that a more deterministic direction of search as done with Tabu Search is worth considering also for SAT and CSP. We give experimental evidence that Tabu Search can be used to eeciently guide local search procedur...
متن کاملA Quantum Random Walk Search Algorithm
Quantum random walks on graphs have been shown to display many interesting properties, including exponentially fast hitting times when compared with their classical counterparts. However, it is still unclear how to use these novel properties to gain an algorithmic speed-up over classical algorithms. In this paper, we present a quantum search algorithm based on the quantum random walk architectu...
متن کاملMultiplicative Approximations of Random Walk Transition Probabilities
We study the space and time complexity of approximating distributions of l-step random walks in simple (possibly directed) graphsG. While very efficient algorithms for obtaining additive -approximations have been developed in the literature, non non-trivial results with multiplicative guarantees are known, and obtaining such approximations is the main focus of this paper. Specifically, we ask t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Europhysics News
سال: 1998
ISSN: 0531-7479,1432-1092
DOI: 10.1007/s00770-998-0046-8